Focusing on the issue of identifying error signatures in Hierarchical Identity Based Cryptography (HIBC) batch verification, a hybrid algorithm of identifying the error signatures was proposed. Firstly, a balanced binary tree was built which used all signatures as the leaves. Secondly, divide-and-conquer and exponent testing methods were used to find error signatures. Meanwhile, the relevance of temporary computing values was used to reduce computing cost. The performance analyses show that the proposed algorithm costs less computation than the individual, the generalized binary splitting, the exponential and the triple pruning search algorithms when there are more than two error signatures. The proposed algorithm can effectively identify error signatures in HIBC batch verification and can be applied in cloud computing authentication.